Asymptotic traveling wave solution for a credit rating migration problem
نویسندگان
چکیده
منابع مشابه
Asymptotic Approximations of the Solution for a Traveling String under Boundary Damping
Transversal vibrations of an axially moving string under boundary damping are investigated. Mathematically, it represents a homogenous linear partial differential equation subject to nonhomogeneous boundary conditions. The string is moving with a relatively (low) constant speed, which is considered to be positive. The string is kept fixed at the first end, while the other end is tied with the ...
متن کاملBiogeography Migration Algorithm for Traveling Salesman Problem
Biogeography-based optimization algorithm(BBO) is a new kind of optimization algorithm based on Biogeography. It is designed based on the migration strategy of animals to solve the problem of optimization. In this paper, a new algorithm-Biogeography Migration Algorithm for Traveling Salesman Problem(TSPBMA) is presented. Migration operator is designed. It is tested on four classical TSP problem...
متن کاملA new integrable hierarchy, parametric solution and traveling wave solution
This paper gives a new integrable hierarchy of nonlinear evolution equations. In this hierarchy there are the following representative equations: ut = ∂ 5 xu − 2 3 , ut = ∂ 5 x (u 1 3 )xx − 2(u 1 6 )x u ; uxxt + 3uxxux + uxxxu = 0. The first two are in the positive order hierarchy while the 3rd one is in the negative order hierarchy. The whole hierarchy is shown integrable through solving a key...
متن کاملPredicting Credit Rating and Credit Rating Changes: A New Approach
In this paper, we propose a hazard rate model for studying credit rating and credit rating changes. Theoretically the hazard rate model is more appropriate than the previous static models. Yet it is difficult to estimate hazard rate model, especially when the covariates are time-varying. This paper extends the results of Shumway(2001) and shows that a multiple-state hazard rate model can be est...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 2016
ISSN: 0022-0396
DOI: 10.1016/j.jde.2016.03.032